package com.fr.lintcode;

public class Q63 {

    /**
     * @param A: an integer ratated sorted array and duplicates are allowed
     * @param target: An integer
     * @return: a boolean 
     * 实际做法应该是用二分查找
     * @see Q63ii
     */
	
    public boolean search(int[] A, int target) {
        // write your code here
    	if (A == null) {
    		return false;
    	}
    	for(int a : A) {
    		if(target == a) {
    			return true;
    		}
    	}
    	return false;
    }


}
